An arithmetic for non-size-increasing polynomial-time computation
نویسندگان
چکیده
An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Gödel’s and therefore defines a non-size-increasing polynomial time computable function.
منابع مشابه
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings
In this paper we study arithmetic computations over non-associative, and non-commutative free polynomials ring F{x1, x2, . . . , xn}. Prior to this work, the non-associative arithmetic model of computation was considered by Hrubes, Wigderson, and Yehudayoff [HWY10]. They were interested in completeness and explicit lower bound results. We focus on two main problems in algebraic complexity theor...
متن کاملEfficient Identity Testing and Polynomial Factorization over Non-associative Free Rings
In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring F{x1, x2, . . . , xn}. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson, and Yehudayoff [HWY10], and they showed lower bounds and proved completeness results. We consider Polynomial Identity Testing (PIT) and polynomial factorization over F{x...
متن کاملSpecial Section: Theory of Computation
simply check whether all coefficients 1 2 , ,..., n i i i c F are zero. The problem becomes non-trivial when the polynomial is given in an implicit form, e.g. as determinant of a matrix with polynomial entries. One can compute the determinant polynomial to express it in the above form. However, the size of the polynomial can grow exponentially in this process and so this algorithm is exponent...
متن کاملSmall space analogues of Valiant's classes and the limitations of skew formula
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relationship in Valiant’s algebraic model of computation, we propose width of an arithmetic circuit as a possible measure of space. We introduce the class VL as an algebraic variant of deterministic log-space L. In the uniform s...
متن کاملSmall-Space Analogues of Valiant's Classes
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relationship in Valiant’s algebraic model of computation, we propose width of an arithmetic circuit as a possible measure of space. We introduce the class VL as an algebraic variant of deterministic log-space L. In the uniform s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 318 شماره
صفحات -
تاریخ انتشار 2004